#include<bits/stdc++.h>
#define ll long long
#define int ll
#define L x<<1
#define R x<<1|1
#define mid (l+r>>1)
#define lc L,l,mid
#define rc R,mid+1,r
#define OK Ll<=l&&r<=Rr
#define Root 1,1,ln
#define rep(x,y,z) for(int x=(y);x<=(z);x++)
#define per(x,y,z) for(int x=(y);x>=(z);x--)
#define repn(x) rep(x,1,n)
#define repm(x) rep(x,1,m)
#define pb push_back
#define e(x) for(int i=h[x],y=to[i];i;i=nxt[i],y=to[i])
#define E(x) for(auto y:p[x])
#define Pi pair<int,int>
#define ui unsigned ll
inline int read(){int s=0,w=1;char c=getchar();while(c<48||c>57) {if(c=='-') w=-1;c=getchar();}while(c>=48&&c<=57)s=(s<<1)+(s<<3)+c-48,c=getchar();return s*w;}
inline void pf(int x){if(x<0) putchar('-'),x=-x;if(x>9)pf(x/10);putchar(x%10+48);}
using namespace std;
const int N=2e5+10,M=7e6+5,inf=(1LL<<31)-1,mod=998244353;
const ll llf=1e18;
inline void add(int &a,int b){((a+=b)>=mod) and (a-=mod);}
inline int Add(int a,int b){return add(a,b),a;}
inline int mul(int a,int b){return 1LL*a*b%mod;}
inline void Mul(int &a,int b){a=mul(a,b);}
inline void red(int &a,int b){add(a,mod-b);}
inline int Red(int a,int b){return red(a,b),a;}
inline int qp(int a,int b){if(!b)return 1;int c=qp(a,b>>1);Mul(c,c);if(b&1)Mul(c,a);return c;}
inline int INV(int x){return qp(x,mod-2);}
int n,m,T0,T1,T2,h[N],to[N<<1],nxt[N<<1],cnt,w1[N<<1],w2[N<<1];
inline void add_(int a,int b,int c,int d){
	to[++cnt]=b,nxt[cnt]=h[a],h[a]=cnt,w1[cnt]=c,w2[cnt]=d;
}
struct node{
	int x,d;
	bool friend operator<(node a,node b){
		return a.d>b.d;
	}
};
int dis[N],st,ed;
bool vis[N];
inline bool check(int l,int r,int Ll,int Rr){
	return r<=Ll||l>=Rr;
}
inline int Calc(int St,int w){
	if(check(St,St+w,st,ed))return w;
	if(st<St)return llf;
}
inline void dijk(){
	priority_queue<node>q;
	repn(i)dis[i]=llf,vis[i]=0;
	q.push({n,0}),dis[n]=0;
	while(!q.empty()){
		int x=q.top().x;q.pop();
		if(vis[x])continue;
		vis[x]=1;
		e(x){
			int W=min(w2[i],Calc(dis[x],w1[i]));
			if(dis[y]>dis[x]+W)dis[y]=dis[x]+W,q.push({y,dis[y]});
		}
	}
}
inline void Main(){
	n=read(),m=read(),T0=read(),T1=read(),T2=read(),st=T0-T2,ed=T0-T1;
	repm(i){
		int x=read(),y=read(),l1=read(),l2=read();
		add_(x,y,l1,l2),add_(y,x,l1,l2);
	}
	dijk();
	repn(i)h[i]=0;cnt=0;
	if(dis[1]>T0)return puts("-1"),void();
	cout <<T0-dis[1]<<'\n';
}
signed main(){
	int T=read();
	while(T--)Main();
	return 0;
}